PSPARQL Query Containment
نویسندگان
چکیده
Querying the semantic web is mainly done through SPARQL. This language has been studied from different perspectives such as optimization and extension. One of its extensions, PSPARQL (Path SPARQL) provides queries with paths of arbitrary length. We study the static analysis of queries written in this language, in particular, containment of queries: determining whether, for any graph, the answers to a query are contained in those of another query. Our approach consists in encoding RDF graphs as transition systems and queries as μ-calculus formulas and then reducing the containment problem to testing satisfiability in the logic. We establish complexity bounds and report experimental results. Key-words: Query Containment, PSPARQL, Semantic Web, RDF, Regular path queries in ria -0 05 98 81 9, v er si on 2 8 Ju n 20 11 Inclusion de Requêtes PSPARQL Résumé : Pas de résumé Mots-clés : Inclusion de requêtes, PSPARQL, web sémantique, RDF, requêtes in ria -0 05 98 81 9, v er si on 2 8 Ju n 20 11 PSPARQL Query Containment 3
منابع مشابه
Static Analysis of Semantic Web Queries
Query containment is defined as the problem of determining if the result of a query is included in the result of another query for any given dataset. It has major applications in query optimization and knowledge base verification. The main objective of this thesis is to provide sound and complete procedures to determine containment of SPARQL queries under expressive description logic axioms. Fu...
متن کاملpSPARQL: A Querying Language for Probabilistic RDF (Extended Abstract)
In this paper, we present a querying language for probabilistic RDF databases, where each triple has a probability, called pSRARQL, built on SPARQL, recommended by W3C as a querying language for RDF databases. Firstly, we present the syntax and semantics of pSPARQL. Secondly, we define the query problem of pSPARQL corresponding to probabilities of solutions. Finally, we show that the query eval...
متن کاملRDF with regular expressions
RDF is a knowledge representation language dedicated to the annotation of resources within the framework of the semantic web. Among the query languages for querying an RDF knowledge base, some, such as SPARQL, are based on the formal semantics of RDF and the concept of semantic consequence, others, inspired by the work in databases, use regular expressions making it possible to search the paths...
متن کاملAnswering SPARQL queries modulo RDF Schema with paths
SPARQL is the standard query language for RDF graphs. In its strict instantiation, it only offers querying according to the RDF semantics and would thus ignore the semantics of data expressed with respect to (RDF) schemas or (OWL) ontologies. Several extensions to SPARQL have been proposed to query RDF data modulo RDFS, i.e., interpreting the query with RDFS semantics and/or considering externa...
متن کاملExtending SPARQL with regular expression patterns (for querying RDF)
RDF is a knowledge representation language dedicated to the annotation of resourceswithin the framework of the semantic web. Among the query languages for RDF, SPARQLallows querying RDF through graph patterns, i.e., RDF graphs involving variables. Otherlanguages, inspired by the work in databases, use regular expressions for searching pathsin RDF graphs. Each approach can expres...
متن کامل